Formalized Confluence of Quasi-Decreasing, Strongly Deterministic Conditional TRSs
نویسندگان
چکیده
We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Loŕıa-Sáenz.
منابع مشابه
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
The decreasing diagrams technique (van Oostrom, 1994) has been successfully used to prove confluence of rewrite systems in various ways; using rule-labelling (van Oostrom, 2008), it can also be applied directly to prove confluence of some linear term rewriting systems (TRSs) automatically. Some efforts for extending the rule-labelling are known, but non-left-linear TRSs are left beyond the scop...
متن کاملFormalizing the Confluence of Orthogonal Rewriting Systems
Orthogonality is a discipline of programming that in a syntactic manner guarantees determinism of functional specifications. Essentially, orthogonality avoids, on the one side, the inherent ambiguity of non determinism, prohibiting the existence of different rules that specify the same function and that may apply simultaneously (non-ambiguity), and, on the other side, it eliminates the possibil...
متن کاملConditional Rewrite Rules: Confluence and Termination
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. Here we consider rewrite rules with conditions, such as they arise, e.g., from algebraic specifications with positive conditional equations. The conditional term rewriting systems thus obtained which we will study, are based upon the well-known class of left-linear, nonambiguous TRSs. A large part o...
متن کاملOn Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
We study (un)soundness of transformations of conditional term rewriting systems (CTRSs) into unconditional term rewriting systems (TRSs). The focus here is on analyzing (un)soundness of so-called unravelings, the most basic and natural class of such transformations. We extend our previous analysis from normal 1-CTRSs to the more general class of deterministic CTRSs (DCTRSs) where extra variable...
متن کاملOn Termination and Confluence of Conditional Rewrite Systems
We consider the problem of verifying connuence and termination of conditional term rewriting systems. Recently we have obtained some interesting results for unconditional term rewriting systems (TRSs) which are non-overlapping or, more generally, locally connuent overlay systems. These results provide suucient criteria for termination plus connuence in terms of restricted termination and connue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.03341 شماره
صفحات -
تاریخ انتشار 2016